Synchronizing Automata over Nested Words
نویسندگان
چکیده
We extend the concept of a synchronizing word from finitestate automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it resets the control state of any configuration, i.e., takes the NWA from all control states to a single control state. We show that although the shortest synchronizing word for an NWA, if it exists, can be (at most) exponential in the size of the NWA, the existence of such a word can still be decided in polynomial time. As our main contribution, we show that deciding the existence of a short synchronizing word (of at most given length) becomes PSPACE-complete (as opposed to NP-complete for DFA). The upper bound makes a connection to pebble games and Strahler numbers, and the lower bound goes via cost-optimal synchronizing words for DFA, an intermediate problem that we also show PSPACE-complete.
منابع مشابه
Infinite Synchronizing Words for Probabilistic Automata
Probabilistic automata are finite-state automata where the transitions are chosen according to fixed probability distributions. We consider a semantics where on an input word the automaton produces a sequence of probability distributions over states. An infinite word is accepted if the produced sequence is synchronizing, i.e. the sequence of the highest probability in the distributions tends to...
متن کاملSynchronizing Automata with Extremal Properties
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length Θ(n 2), where n is the number of states of the automaton. This disproves a conjecture that every subset in a strongly connected synchronizing automaton is cn-extendable, for some cons...
متن کاملAlternation Elimination for Automata over Nested Words
This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs). With these alternation-elimination constructions at hand, we straightforwardly obtain translations from various temporal logics over nested words from the literature like CaRet and μNWTL, and extensions thereof to NWAs, which correct, simplify, improve, and generalize the pr...
متن کاملSynchronizing groups and automata
Pin showed that every p-state automaton (p a prime) containing a cyclic permutation and a non-permutation has a synchronizing word of length at most (p− 1). In this paper we consider permutation automata with the property that adding any non-permutation will lead to a synchronizing word and establish bounds on the lengths of such synchronizing words. In particular, we show that permutation grou...
متن کاملInfinite Synchronizing Words for Probabilistic Automata (Erratum)
In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the decidability result of [1,2,3] for the emptiness problem of weakly synchronizing language is incorrect.
متن کامل